Enhanced adaptive partitioning in a distributed graph database
نویسندگان
چکیده
منابع مشابه
Distributed Evolutionary Graph Partitioning
We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partiti...
متن کاملGraph partitioning for scalable distributed graph computations
Inter-node communication time constitutes a significant fraction of the execution time of graph algorithms on distributed-memory systems. Global computations on large-scale sparse graphs with skewed degree distributions are particularly challenging to optimize for, as prior work shows that it is difficult to obtain balanced partitions with low edge cuts for these graphs. In this work, we attemp...
متن کاملDistributed CSPs by graph partitioning
Nowadays, many real problems in artificial intelligence can be modelled as constraint satisfaction problems (CSPs). A general CSP is known to be NP-complete. Nevertheless, distributed models may reduce the exponential complexity by partitioning the problem into a set of subproblems. In this paper, we present a preprocess technique to break a single large problem into a set of smaller loosely co...
متن کاملGraSP: Distributed Streaming Graph Partitioning
This paper presents a distributed, streaming graph partitioner, Graph Streaming Partitioner (GraSP), which makes partition decisions as each vertex is read from memory, simulating an online algorithm that must process nodes as they arrive. GraSP is a lightweight high-performance computing (HPC) library implemented in MPI, designed to be easily substituted for existing HPC partitioners such as P...
متن کاملAdaptive Graph Partitioning Wireless Protocol
We propose a new wireless protocol, called the Adaptive Graph Partitioning Wireless Protocol, that dynamically partitions nodes into the available logical channels in such a manner so as to improve performance by balancing the intra-logical channel traffic between the available logical channels, and minimising the inter-logical channel traffic. We have simulated the performance of a simplified ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information and Telecommunication
سال: 2020
ISSN: 2475-1839,2475-1847
DOI: 10.1080/24751839.2020.1829387